Lecture Notes on a Parallel Algorithm for Generating a Maximal Independent Set
نویسنده
چکیده
In this lecture we present a randomized parallel algorithm for generating a maximal independent set. We then show how to derandomize the algorithm using pairwise independence. For an input graph with n vertices, our goal is to devise an algorithm that works in time polynomial in log n and using polynomial in n processors. See Chapter 12.1 of Motwani and Raghavan [5] for background on parallel models of computation (specifically the CREW PRAM model) and the associated complexity classes NC and RNC.
منابع مشابه
Randomized Algorithms 2014 / 5 A Lecture 2 – Maximal Independent Set , Analysis of Randomized
We considered a distributed model of computing where nodes in a graph contain processors and they can talk to their immediate neighbors. The goal now is to collectively compute something. In particular for the maximal independent set problem the goal is to a pick a set of nodes S such that S is a maximal independent set of the underlying graph and each node determines whether or not it is in S....
متن کاملAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملOn the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph
We consider the parallel greedy algorithm of Coppersmith, Raghavan and Tompa [CRT] for finding the lexicographically first maximal independent set of a graph. We prove an Ω(logn) bound on the expected number of iterations for most edge densities. This complements the O(logn) bound proved in Calkin and Frieze [CF]. ∗Research supported in part by NSF Grant CCR–8900112
متن کاملAn Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2 with (k, r)-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r. We consider the problem MIS(A, I): given a hypergraph A and a subfamily I ⊆ I(A), of its maximal independent sets (MIS) I(A), either extend this subfamily by constructing a new MIS...
متن کامل